The mobile production vehicle routing problem: Using 3D printing in last mile distribution

We study a new variant of the vehicle routing problem, called Mobile Production Vehicle Routing Problem (MoP-VRP). In this vehicles are equipped with 3D printers, and production takes place on way to customer. The objective is minimize weighted cost incurred by travel delay service. formulate Mixed Integer Programming (MIP) model develop an Adaptive Large Neighbourhood Search (ALNS) heuristic for problem. To show advantage mobile production, we compare problem Central (CP-VRP), where in central depot. also propose efficient ALNS CP-VRP. generate benchmark instances based Time Windows (VRPTW) instances, realistic real-life data provided Danish Company Printhuset. Overall, proposed both problems efficient, solve up 200 customers within short computational time. test different scenarios varying numbers machines each vehicle, as well results that these key factors influence costs. flexibility: it can shorten time span from start delivery products, at same lower Moreover, long-term estimations technology has low operation costs thus feasible real life practice.